package LeetCode刷题;

/**
 * @program: Java_Study
 * @author: Xiaofan
 * @createTime: 2021-11-08 15:48
 * @description: Functions of this class is
 * dp[i]=（1≤j<i） {max(j×(i−j),j×dp[i−j])}
 * 官方题解：
 * class Solution {
 *     public int integerBreak(int n) {
 *         int[] dp = new int[n + 1];
 *         for (int i = 2; i <= n; i++) {
 *             int curMax = 0;
 *             for (int j = 1; j < i; j++) {
 *                 curMax = Math.max(curMax, Math.max(j * (i - j), j * dp[i - j]));
 *             }
 *             dp[i] = curMax;
 *         }
 *         return dp[n];
 *     }
 * }
 *
 *
 **/
public class NoNo动态规划整数拆分OR剪绳子I {
    public static void main(String args[]){

    }
}